K-Nearest Neighbor Based Missing Data Estimation Algorithm in Wireless Sensor Networks
نویسندگان
چکیده
منابع مشابه
K-Nearest Neighbor Based Missing Data Estimation Algorithm in Wireless Sensor Networks
In wireless sensor networks, the missing of sensor data is inevitable due to the inherent characteristic of wireless sensor networks, and it causes many difficulties in various applications. To solve the problem, the missing data should be estimated as accurately as possible. In this paper, a k-nearest neighbor based missing data estimation algorithm is proposed based on the temporal and spatia...
متن کاملAn Estimation Algorithm for Missing Data in Wireless Sensor Networks
For estimating the missing data of wireless sensor networks, an estimation algorithm called HD method, which can make use of sensoring space-time correlation of the data, was proposed based on mathematical Hermite and DESM statistical models. The algorithm not only can adaptively adjust the time and space weights, but also can accurately estimate the missing or unavailable data. The experimenta...
متن کاملDrought Monitoring and Prediction using K-Nearest Neighbor Algorithm
Drought is a climate phenomenon which might occur in any climate condition and all regions on the earth. Effective drought management depends on the application of appropriate drought indices. Drought indices are variables which are used to detect and characterize drought conditions. In this study, it was tried to predict drought occurrence, based on the standard precipitation index (SPI), usin...
متن کاملAn Adaptive LEACH-based Clustering Algorithm for Wireless Sensor Networks
LEACH is the most popular clastering algorithm in Wireless Sensor Networks (WSNs). However, it has two main drawbacks, including random selection of cluster heads, and direct communication of cluster heads with the sink. This paper aims to introduce a new centralized cluster-based routing protocol named LEACH-AEC (LEACH with Adaptive Energy Consumption), which guarantees to generate balanced cl...
متن کاملProcessing k nearest neighbor queries in location-aware sensor networks
Efficient search for k nearest neighbors to a given location point (called a KNN query) is an important problem arising in a variety of sensor network applications. In this paper, we investigate in-network query processing strategies under a KNN query processing framework in location-aware wireless sensor networks. A set of algorithms, namely the geo-routing tree, the KNN boundary tree and the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Wireless Sensor Network
سال: 2010
ISSN: 1945-3078,1945-3086
DOI: 10.4236/wsn.2010.22016